Reasoning about Grover's quantum search algorithm using probabilistic wp
نویسندگان
چکیده
منابع مشابه
Probabilistic Power Distribution Planning Using Multi-Objective Harmony Search Algorithm
In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...
متن کاملReasoning about Grover ’ s Quantum Search
MICHAEL BUTLER and PIETER HARTEL Department of Electronics & Computer Science University of Southampton Southampton SO17 1BJ United Kingdom {mjb,phh}@ecs.soton.ac.uk Grover's search algorithm is designed to be executed on a quantum-mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides...
متن کاملReasoning about Probabilistic Security Using Task-PIOAs
Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framework for the universal composability paradigms of protocol security. One of their advantages is that that they allow one to distinguish high-level nondeterminism that can affect the outcome of the protocol, from low-level choices...
متن کاملReasoning about probabilistic sequential programs
A complete and decidable Hoare-style calculus for iteration-free prob-abilistic sequential programs is presented using a state logic with truth-functional propositional (not arithmetical) connectives.
متن کاملReasoning Algebraically About Probabilistic Loops
Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calculus. We extend their work to reasoning about probabilistic loops in the probabilistic refinement calculus. We apply our algebraic reasoning to derive transformation rules for probabilistic action systems. In particular we focus on developing data refinement rules for probabilistic action systems. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1999
ISSN: 0164-0925,1558-4593
DOI: 10.1145/319301.319303